Search results for "Network scheduler"
showing 3 items of 3 documents
Adding Real-Time Networking and QoS Capabilities to RTLinux-GPL
2006
This paper presents an architecture to build distributed embedded real-time systems in the RTLinux-GPL platform. The architecture (built in a layered fashion) has being built around open source projects ranging from Ethernet drivers to a CORBA environment. The paper focuses on those layers that give support for QoS and real-time networking over Ethernet networks. The main ideas are: to accomplish deterministic access times by using a TDMA protocol over Ethernet and to multiplex different types of traffic in that real-time network, providing different service types (QoS) to each type of traffic without jeopardizing the a priori guarantee of the system's real-time properties. Traffic types in…
Dynamic packet scheduling performance in UTRA Long Term Evolution downlink
2008
In this paper we evaluate the performance of dynamic Packet Scheduling (PS) of 3GPP UTRAN Long Term Evolution (LTE) Downlink. Packet scheduling is of utmost importance in 3G LTE, because all traffic types with different Quality of Service requirements are competing of the resources. We present a decoupled time and frequency domain packet scheduling framework for LTE downlink. Simulation results with three basic packet scheduler combinations with different amount of fairness are presented in four different 3GPP macro simulation cases to show the both extremes in tradeoff between fairness and spectral efficiency. In addition, the effect of multiuser diversity on packet scheduling performance …
Gradient Scheduling Algorithm for Fair Delay Guarantee in Logarithmic Pricing Scenario
2008
In this paper we propose a packet scheduling scheme for ensuring delay as a Quality of Service (QoS) requirement. For customers, fair service is given while optimizing revenue of the network service provider. Gradient type algorithm for updating the weights of a packet scheduler is derived from a revenue-based optimization problem in the logarithmic pricing scenario. Algorithm is simple to implement. We compared algorithm with optimal brute-force method. The weight updating procedure is independent on the assumption of the connection's statistical behavior, and therefore it is robust against erroneous estimates of statistics.